Contractibility and Contractible Approximations of Soft Global Constraints
نویسنده
چکیده
We study contractibility and its approximation for two very general classes of soft global constraints. We introduce a general formulation of decomposition-based soft constraints and provide a sufficient condition for contractibility and an approach to approximation. For edit-based soft constraints, we establish that the tightest contractible approximation cannot be expressed in edit-based terms, in general.
منابع مشابه
A note on essentially left $phi$-contractible Banach algebras
In this note, we show that cite[Corollary 3.2]{sad} is not always true. In fact, we characterize essential left $phi$-contractibility of the group algebras in terms of compactness of its related locally compact group. Also, we show that for any compact commutative group $G$, $L^{2}(G)$ is always essentially left $phi$-contractible. We discuss the essential left $phi$-contractibility of some Fou...
متن کاملOpen Contractible Global Constraints
Open forms of global constraints allow the addition of new variables to an argument during the execution of a constraint program. Such forms are needed for difficult constraint programming problems where problem construction and problem solving are interleaved. However, in general, filtering that is sound for a global constraint can be unsound when the constraint is open. This paper provides a ...
متن کاملContractibility for open global constraints
Open forms of global constraints allow the addition of new variables to an argument during the execution of a constraint program. Such forms are needed for difficult constraint programming problems where problem construction and problem solving are interleaved, and fit naturally within constraint logic programming. However, in general, filtering that is sound for a global constraint can be unso...
متن کاملThe structure of module contractible Banach algebras
In this paper we study the module contractibility ofBanach algebras and characterize them in terms the conceptssplitting and admissibility of short exact sequences. Also weinvestigate module contractibility of Banach algebras with theconcept of the module diagonal.
متن کاملSimultaneous Adversarial Multi-Robot Learning
Open forms of global constraints allow the addition of new variables to an argument during the execution of a constraint program. Such forms are needed for difficult constraint programming problems where problem construction and problem solving are interleaved. However, in general, filtering that is sound for a global constraint can be unsound when the constraint is open. This paper provides a ...
متن کامل